An Implementation of Karr’s Summation Algorithm in Mathematica∗
نویسنده
چکیده
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on almost any computer algebra platform. We report here about an implementation of an algorithm by Karr, the most general indefinite summation algorithm known. Karr’s algorithm is, in a sense, the summation counterpart of Risch’s algorithm for indefinite integration. This is the first implementation of this algorithm in a major computer algebra system. Our version contains new extensions to handle also definite summation problems. In addition we provide a feature to find automatically appropriate difference field extensions in which a closed form for the summation problem exists. These new aspects are illustrated by a variety of examples.
منابع مشابه
Algebraic Extensions for Symbolic Summation
The main result of this thesis is an effective method to extend Karr’s symbolic summation framework to algebraic extensions. These arise, for example, when working with expressions involving (−1)n. An implementation of this method, including a modernised version of Karr’s algorithm is also presented. Karr’s algorithm is the summation analogue of the Risch algorithm for indefinite integration. I...
متن کاملA Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric summation is presented. In particular, it is shown how Paule’s concept of greatest factorial factorization of polynomials can be extended to the bibasic case. It turns out that most of the bibasic hypergeometric summation identities from literature can be proved and even found this way. A Mathem...
متن کاملA Refined Difference Field Theory for Symbolic Summation
In this article we present a refined summation theory based on Karr’s difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to evaluate Feynman integrals from Perturbative Quantum Field Theory.
متن کاملIndefinite summation with unspecified summands
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr’s algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach.
متن کاملGreatest Factorial Factorization and Symbolic Summation
At present the most general algebraic and algorithmic frame for discussing the problem of indefinite summation is provided by the work of Karr (1981, 1985). His method, working over ΠΣ-fields which are certain difference field extensions of a constant field K, can be viewed as a summation analogue to Risch’s integration method. A difference field simply is a field F together with an automorphis...
متن کامل